A Survey on Lexical Simpli cation

نویسندگان

  • Gustavo Paetzold
  • Lucia Specia
چکیده

Lexical Simplification is the process of replacing complex words in a given sentence with simpler alternatives of equivalent meaning. This task has wide applicability both as an assistive technology for readers with cognitive impairments or disabilities, such as Dyslexia and Aphasia, and as a pre-processing tool for other Natural Language Processing tasks, such as machine translation and summarisation. The problem is commonly framed as a pipeline of four steps: the identification of complex words, the generation of substitution candidates, the selection of those candidates that fit the context, and the ranking of the selected substitutes according to their simplicity. In this survey we review the literature for each step in this typical Lexical Simplification pipeline and provide a benchmarking of existing approaches for these steps on publicly available datasets. We also provide pointers for datasets and resources available for the task.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Approach to Subdivision Simpli cation

The line simpli cation problem is an old and well-studied problem in cartography. Although there are several algorithms to compute a simpli cation, there seem to be no algorithms that perform line simpli cation in the context of other geographical objects. This paper presents a nearly quadratic time algorithm for the following line simpli cation problem: Given a polygonal line, a set of extra p...

متن کامل

Comparing Tree-Simpli cation Procedures1

Leonard A. Breslow and David W. Aha Navy Center for Applied Research in Arti cial Intelligence Naval Research Laboratory Washington, DC 20375 fbreslow,[email protected] http://www.aic.nrl.navy.mil/ fbreslow,ahag 1 Problem and Contribution Induced decision trees are frequently used by researchers in the machine learning and statistics communities to solve classi cation tasks (Breiman et al. ...

متن کامل

Interval Methods for Model Qualification: Methodology and Advanced Application

It is often too complex to use, and sometimes impossible to obtain, an actual model in simulation or command eld . To handle a system in practice, a simpli cation of the real model is then necessary. This simpli cation goes through some hypotheses made on the system or the modeling approach. In this paper, we deal with all models that can be expressed by real-valued variables involved in analyt...

متن کامل

Distributed and Scalable Anisomorphic Geometric Simpli cation

Geometric simpli cation is a well-known technique for simplifying complex geometric models. Previous work in this area in the past has consisted primarily of lossless compression and errorbounded simpli cation techniques. By removing such constraints, we can anisomorphically reduce a model's representation|cheaply and e ciently|down to as little as 0% of its original size. We perform such simpl...

متن کامل

Discrete Geometric Shapes Matching Interpolation and Approximation A Survey

In this survey we consider geometric techniques which have been used to measure the similarity or distance between shapes as well as to approximate shapes or interpolate between shapes Shape is a modality which plays a key role in many disciplines ranging from computer vision to molecular biology We focus on algorithmic techniques based on computational geometry that have been developed for sha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Artif. Intell. Res.

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2017